Queues with Correlated Service and Inter-Arrival Times and Their Application to Optical Buffers
نویسندگان
چکیده
منابع مشابه
Queues with correlated service and inter-arrival times and its application to optical buffers
This paper presents an algorithmic procedure to calculate the queue length and delay distribution of customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on the inter-arrival time between himself and his predecessor. Setting up a Markov chain that keeps track of the contents of such a queue will result in a state space explosion as the inter-a...
متن کاملOn Queues with Inter-Arrival Times Proportional to Service Times
We analyze a family of queueing systems where the interarrival time I n+1 between customers n and n + 1 depends on the service time B n of customer n. Speciically, we consider cases where the dependency between I n+1 and B n is a proportionality relation, and B n is an exponentially distributed random variable. Such dependencies arise in the context of packet-switched networks which use rate po...
متن کاملPerformance of correlated queues: the impact of correlated service and inter-arrival times
In this paper, we consider correlated queues where the service time of a packet is strongly correlated with its inter-arrival time due to the finite transmission capacity of input and output links. We present an analytical method to derive the LST (Laplace Stieltjes Transform) of the (actual) waiting time distribution and the system time distribution. To investigate the impact of such correlati...
متن کاملTandem queues with subexponential service times and finite buffers
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room for finished customers after the last station but the size of the buffer between two consecutive stations is finite. Using (max,+) linear recursions, we investigate the tail asymptotics of transient response times and w...
متن کاملUsing Inter-Arrival Times For Scheduling In Non-Observable Queues
In online dispatching systems, when there is no opportunity to observe the state of the systems’ components, one may implement “blind” scheduling policies i.e. those which use incomplete/indirect observations of the system state or do not use any information at all. Here we deal with the well-known problem of scheduling in several non-observable parallel single server queues with single Poisson...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Models
سال: 2006
ISSN: 1532-6349,1532-4214
DOI: 10.1080/15326340600649011